Optimasi Rute Pengiriman BBM dengan Heterogeneous Vehicle Routing Problem With Multi-Trips
نویسندگان
چکیده
Peningkatan kendaraan bermotor berdampak pada peningkatan frekuensi konsumsi BBM, seperti saat weekend, arus mudik. Depot BBM X bertugas mengirimkan ke sejumlah SPBU yang tersebar di wilayah Yogyakarta, diminta untuk dapat menjaga kelancaran dan ketepatan waktu dalam pendistribusiannya segala situasi kondisi. kerap kali berhadapan dengan kendala pengiriman terlalu lama, juga disebabkan oleh rute kurang optimal sehingga total jarak tempuh menjadi lebih panjang. Penelitian bertujuan menentukan agar meminimalkan tempuh. Jika berkurang, produk diperkirakan akan singkat. Pemecahan masalah diterapkan Heterogeneous Vehicle Routing Problem (HVRP) mempertimbangkan apakah suatu melakukan dari satu perjalanan hari kerja (multi trip), penentuan berdasar Cluster, kelas jalan menggunakan metode Branch and Bound LINGO Solver. Hasil optimasi diperoleh menunjukkan penurunan Cluster 1 sebesar 6,55%, cluster 2 23,84%, 3 9,57%.
منابع مشابه
The Vehicle Routing Problem with Multiple Trips
Non-asset based third-party logistics providers manage fleets of leased vehicles for their customers. Due to high leasing costs, minimizing the number of vehicles employed in daily operations is of primary concern to such firms. Consequently, routings that involve fewer vehicles and potentially longer travel times are favored over routings that involve additional vehicles. Constructing routes t...
متن کاملSolving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition
This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملMemetic Algorithm for a Multi-Objective Vehicle Routing Problem with Multiple Trips
This paper considers a variant of the vehicle routing problem where vehicles are allowed to take more than one route during the working day. A restricted fleet size is used in order to serve customers’ demand. Therefore, vehicles could exceed the time horizon. The objective is to optimize both maximum overtime and routing cost. A mathematical model has been proposed for the VRPM. A memetic algo...
متن کاملcapacitated multi-depot vehicle routing problem with inter-depot routes
in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: G-Tech
سال: 2023
ISSN: ['2580-8737', '2623-064X']
DOI: https://doi.org/10.33379/gtech.v7i3.2720